Transductive Learning on Adaptive Graphs
نویسندگان
چکیده
Graph-based semi-supervised learning methods are based on some smoothness assumption about the data. As a discrete approximation of the data manifold, the graph plays a crucial role in the success of such graphbased methods. In most existing methods, graph construction makes use of a predefined weighting function without utilizing label information even when it is available. In this work, by incorporating label information, we seek to enhance the performance of graph-based semi-supervised learning by learning the graph and label inference simultaneously. In particular, we consider a particular setting of semi-supervised learning called transductive learning. Using the LogDet divergence to define the objective function, we propose an iterative algorithm to solve the optimization problem which has closed-form solution in each step. We perform experiments on both synthetic and real data to demonstrate improvement in the graph and in terms of classification accuracy.
منابع مشابه
Transductive Ranking on Graphs
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or ordering over the object space. We consider the problem of learning such a ranking function in a transductive, graph-based setting, where the object space is finite and is represented as a graph in which vertices correspond...
متن کاملSmooth Harmonic Transductive Learning
In this paper, we present a novel semi-supervised smooth harmonic transductive learning algorithm that can get closed-form solution. Our method introduces the unlabeled class information to the learning process and tries to exploit the similar configurations shared by the label distribution of data. After discovering the property of smooth harmonic function based on spectral clustering in class...
متن کاملRegularization on Graphs with Function-adapted Diffusion Processes
The use of data-adapted kernels has been shown to lead to state-of-the-art results in machine learning tasks, especially in the context of semi-supervised and transductive learning. We introduce a general framework for analysis both of data sets and functions defined on them. Our approach is based on diffusion operators, adapted not only to the intrinsic geometry of the data, but also to the fu...
متن کاملTransductive Learning over Graphs: Incremental Assessment
Graphs constitute a most natural way to represent problems involving finite or countable universes. This might be especially so in the context of bio-informatics (e.g. for protein-interaction graphs), collaborative filtering, the analysis of social networks and citation graphs, and to various problems in operations research in the context of incomplete information. A further argument for using ...
متن کامل